TRB exam online practice test for Computer Science and Engineering dept provides you with ample practice material for TRB exam preparation for cse department which adheres to the real exam format. Each TRB - CSE exam practice test has 10 questions. After completing click on to the COMPLETE TEST to know the score and the correct answers.


Computer Science and Engineering - TRB Online Practice Test - 2

  • Online Practice Test - CSE
   

1.
  If the number of bits in a virtual address of a program is 16 and the page size is 0.5k bytes, the number of pages in the virtual address space is:.
  • A.   16
  •  
  • B.   32
  •  
  • C.   64
  •  
  • D.   128
  Options: A    B    C    D   
   
 
   

2.
  How many valid serial schedules are possible for four transactions?.
  • A.   24
  •  
  • B.   16
  •  
  • C.   4
  •  
  • D.   8
  Options: A    B    C    D   
   
   

3.
  Two transactions T1 and T2 do conflict each other if:
a) T1 and T2 read the same data item
b) T1 reads while T2 writes the same data item
c) T 2 reads while T1 writes the same data item
d) T1 and T2 write the same data item .
  • A.   (a) and (b)
  •  
  • B.   (a) and (d)
  •  
  • C.   (b), (c) and (d)
  •  
  • D.   (a), (b) and (c)
  Options: A    B    C    D   
   
 
   

4.
  Fudge factor is considered to .
  • A.   Avoid deadlock during concurrent execution
  •  
  • B.   Avoid starvation during concurrent execution
  •  
  • C.   Handle bucket overflow in hashing
  •  
  • D.   Link the buckets
  Options: A    B    C    D   
   
   

5.
  Which of the following is incorrect?.
  • A.   Every recursive language is recursively enumerable
  •  
  • B.   If L1 and L2 are recursively enumerable languages over ε, then L1 ∪ L2 and L1 ∩ L1 are also recursively enumerable
  •  
  • C.   A language L subset ε* is recursively enumerable if and only if L can be enumerated by some finite state machine
  •  
  • D.   L is recursive if and only if there is a Turing machine that enumerates L in canonical
  Options: A    B    C    D   
   
 
   

6.
  Which of the following statement is false?.
  • A.   Every regular language can e accepted y a DPDA M with only two states in which there are no ' ε' transitions and no symbols are ever removed from the stack
  •  
  • B.   If L is accepted by a DPDA and NPDA then L is regular
  •  
  • C.   If L is accepted by a PDA in which no symbols are ever removed from the stack, then
  •  
  • D.   Suppose L subset ε* in accepted y a PDA M, and that for some fixed 'K' and every xε* no sequence of moves made by M on input 'x' causes the stack to have more than 'K' elements then L is regular
  Options: A    B    C    D   
   
   

7.
  What is K - clique of graph?.
  • A.   Set of 'K' nodes in the graph such that all 'K' nodes are connected
  •  
  • B.   Set of 'K' nodes in the graph such that there is an edge between every two nodes
  •  
  • C.   Set of 'K' nodes in the graph such that all 'K' nodes are not connected
  •  
  • D.   Set of 'K' nodes in the graph such that no two nodes are connected
  Options: A    B    C    D   
   
 
   

8.
  A decoder is a combinational circuit that converts the binary information from ‘n’ input lines to a maximum of unique output lines..
  • A.   2n-1
  •  
  • B.   2n
  •  
  • C.   2n-1
  •  
  • D.   2n-1
  Options: A    B    C    D   
   
   

9.
  Simplify the following Boolean expression to a maximum number of literals: xy + xyz' + xyz' + xzy .
  • A.   xy +yz
  •  
  • B.   y
  •  
  • C.   xy
  •  
  • D.   x
  Options: A    B    C    D   
   
 
   

10.
  To construct a 16 x 1 multiplexer, how many 8X1 multiplexers and 2x1 multiplexers are needed respectively:.
  • A.   2,1
  •  
  • B.   8,2
  •  
  • C.   2,8
  •  
  • D.   4,2
  Options: A    B    C    D   
   

Complete Test
tnscholars.com

 

 

 

tnscholars.com.